Niche Genetic Algorithm for Solving Multiplicity Problems in Genetic Association Studies
نویسندگان
چکیده
منابع مشابه
genetic algorithm based on explicit memory for solving dynamic problems
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...
متن کاملA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
متن کاملSolving Timetabling problems using Genetic Algorithm Technique
The timetabling problem is always a difficult task which comes up every calendar year in educational institutions. More especially if it has to be done manually. Various institutions of learning across the country are being faced with a lot of difficulties preparing examination timetable. Most of this problems are usually attributed to the constant increase in the number of students and courses...
متن کاملSolving Timetabling problems using Genetic Algorithm Technique
The timetabling problem is always a difficult task which comes up every calendar year in educational institutions. More especially if it has to be done manually. Various institutions of learning across the country are being faced with a lot of difficulties preparing examination timetable. Most of this problems are usually attributed to the constant increase in the number of students and courses...
متن کاملSolving Timetabling problems using Genetic Algorithm Technique
The timetabling problem is always a difficult task which comes up every calendar year in educational institutions. More especially if it has to be done manually. Various institutions of learning across the country are being faced with a lot of difficulties preparing examination timetable. Most of this problems are usually attributed to the constant increase in the number of students and courses...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Automation & Soft Computing
سال: 2020
ISSN: 1079-8587
DOI: 10.32604/iasc.2020.013926